Search space boundary extension method in real-coded genetic algorithms
نویسندگان
چکیده
منابع مشابه
Search space boundary extension method in real-coded genetic algorithms
In real-coded genetic algorithms, some crossover operators do not work well on functions which have their optimum at the corner of the search space. To cope with this problem, we have proposed a boundary extension methods which allows individuals to be located within a limited space beyond the boundary of the search space. In this paper, we give an analysis of the boundary extension methods fro...
متن کاملSampling Bias and Search Space Boundary Extension in Real Coded Genetic Algorithms
In Real coded genetic algorithms, some crossover operators do not work well on functions which have their optimum at the corner of the search space. To cope with this problem, we have proposed boundary extension methods which allows individuals to be located within a limited space beyond the boundary of the search space. In this paper, we give an analysis of the boundary extension methods from ...
متن کاملMulti-parent Recombination in Genetic Algorithms with Search Space Boundary Extension by Mirroring
Abstract. In previous work, we have investigated real coded genetic algorithms with several types of multi-parent recombination operators and found evidence that multi-parent recombination with center of mass crossover (CMX) seems a good choice for real coded GAs. But CMX does not work well on functions which have their optimum on the corner of the search space. In this paper, we propose a meth...
متن کاملGradual Distributed Real - Coded Genetic Algorithms 1
Genetic algorithm behavior is determined by the exploration/exploitation balance kept throughout the run. When this balance is disproportionate, the premature convergence problem will probably appear, causing a drop in the genetic algorithm's eecacy. One approach presented for dealing with this problem is the distributed genetic algorithm model. Its basic idea is to keep, in parallel, several s...
متن کاملGradual distributed real-coded genetic algorithms
A major problem in the use of genetic algorithms is premature convergence, a premature stagnation of the search caused by the lack of diversity in the population. One approach for dealing with this problem is the distributed genetic algorithm model. Its basic idea is to keep, in parallel, several subpopulations that are processed by genetic algorithms, with each one being independent of the oth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2001
ISSN: 0020-0255
DOI: 10.1016/s0020-0255(01)00087-1